A High-Speed Square Root Algorithm in Extension Fields
نویسندگان
چکیده
A square root (SQRT) algorithm inGF (p) (m=r0r1 · · · rn−12, ri: odd prime, d>0: integer) is proposed in this paper. First, the TonelliShanks algorithm is modified to compute the inverse SQRT in GF (p d ), where most of the computations are performed in the corresponding subfields GF (p i ) for 0 i d − 1. Then the Frobenius mappings with an addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field GF (p) are also reduce to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. More specifically the Tonelli-Shanks algorithm and the proposed algorithm in GF (p), GF (p) and GF (p) were implemented on a Pentium4 (2.6 GHz) computer using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerates the SQRT computation by 25 times in GF (p), by 45 times in GF (p), and by 70 times in GF (p), compared to the Tonelli-Shanks algorithm, which is supported by the evaluation of the number of computations.
منابع مشابه
A High - Speed Square Root Algorithm for Extension fields – Especially for Fast Extension Fields –
A square root (SQRT) algorithm in extension field Fpm(m = r0r1 · · · rn−1 · 2, ri : odd prime, d : positive integer) is proposed in this paper. First, a conventional SQRT algorithm, the TonelliShanks algorithm, is modified to compute the inverse SQRT in F p2 , where most of the computations are performed in the corresponding subfields Fp2i for 0 6 i 6 d − 1. Then the Frobenius mappings with add...
متن کاملHigh-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root
A new method for the high-speed computation of double-precision floating-point reciprocal, division, square root, and inverse square root operations is presented in this paper. This method employs a second-degree minimax polynomial approximation to obtain an accurate initial estimate of the reciprocal and the inverse square root values, and then performs a modified Goldschmidt iteration. The hi...
متن کاملCost/Performance Tradeoff of n-Select Square Root Implementations
Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select implementations (nS-Root) based on a non-restoring-remainder square root algorithm. The nSRoot uses a parallel array of carry-save adders (CSAs). For a square root bit calculation, a CSA is used once. This means that the c...
متن کاملModeling and Realization of the Floating Point Inverse Square Root, Square Root, and Division unit (fP ISD) Using VHDL and FPGAs
In this paper, we model and synthesis a high speed Arithmetic inverse square root, square root, and division (ISD) unit based on existing algorithms similar to the unit in [3]. With area/speed tradeoff limitation, our concentration was on designing high speed Arithmetic units with moderate area increase. Our concentration on the (ISD) unit using digit recurrence algorithms led to the modeling o...
متن کاملDecimal SRT Square Root: Algorithm and Architecture
Given the popularity of decimal arithmetic, hardware implementation of decimal operations has been a hot topic of research in recent decades. Besides the four basic operations, the square root can be implemented as an instruction directly in the hardware, which improves the performance of the decimal floating-point unit in the processors. Hardware implementation of decimal square rooters is usu...
متن کامل